Efficient Nash Equilibrium Under Adverse Selection

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nash equilibrium

In game theory, Nash equilibrium (named after John Forbes Nash, who proposed it) is a solution concept of a game involving two or more players, in which each player is assumed to know the equilibrium strategies of the other players, and no player has anything to gain by changing only his own strategy unilaterally. If each player has chosen a strategy and no player can benefit by changing his or...

متن کامل

Bertrand-nash Equilibrium in the Retail Duopoly Model under Asymmetric Costs

In this paper, the Bertrand's price competition in the retail duopoly with asymmetric costs is analyzed. Retailers sell substitute products in the framework of the classical economic order quantity (EOQ) model with linear demand function. The market potential and competitor price are considered to be the bifurcation parameters of retailers. Levels of the barriers to market penetration depending...

متن کامل

Approximate Nash equilibrium under the single crossing conditions

We consider strategic games where strategy sets are linearly ordered while the preferences of the players are described by binary relations. All restrictions imposed on the preferences are satisfied in the case of epsilon-optimization of a bounded-above utility function. A Nash equilibrium exists and can be reached from any strategy profile after a finite number of best response improvements if...

متن کامل

Efficient Nash equilibrium approximation through Monte Carlo counterfactual regret minimization

Recently, there has been considerable progress towards algorithms for approximating Nash equilibrium strategies in extensive games. One such algorithm, Counterfactual Regret Minimization (CFR), has proven to be effective in two-player zero-sum poker domains. While the basic algorithm is iterative and performs a full game traversal on each iteration, sampling based approaches are possible. For i...

متن کامل

Refinements of Nash Equilibrium

In game theory, “refinement” refers to the selection of a subset of equilibria, typically on the grounds that the selected equilibria are more plausible than other equilibria. These notes are a brief, largely informal, survey of some of the most heavily used refinements. Throughout, “equilibria” means Nash equilibria (NE), unless I state otherwise explicitly. And throughout, I assume that the g...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SSRN Electronic Journal

سال: 2011

ISSN: 1556-5068

DOI: 10.2139/ssrn.1944825